Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of

Source URL: community.haskell.org

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Data types
• Programming language comparisons
• Type theory
• Higher-order functions
• Fold
• Generic programming
• Map
• Type class

Implementing a Bibliography Processor in Scheme Jean-Michel Hufflen LIFC (FRE CNRSUniversity of Franche-Comté 16, route de GrayBESANÇON CEDEX

Source URL: www.deinprogramm.de

• Software engineering
• Software
• Computer programming
• Functional programming
• Subroutines
• BibTeX
• Functional languages
• Scheme
• LaTeX
• Eval
• Parsing
• Function composition

From Stack Traces to Lazy Rewriting Sequences Stephen Chang1 , Eli Barzilay1 , John Clements2 , and Matthias Felleisen1 1 2

Source URL: www.ccs.neu.edu

• Software engineering
• Computer programming
• Computing
• Functional languages
• Evaluation strategy
• Computability theory
• Lambda calculus
• Theoretical computer science
• Lazy evaluation
• Functional programming
• ALGOL 68
• Racket

Design of Parallel and High-Performance Computing Fall 2014 Lecture: Scheduling Instructor: Torsten Hoefler & Markus Püschel

Source URL: spcl.inf.ethz.ch

• Software engineering
• Computer programming
• Computing
• Scheduling
• Functional languages
• Concurrent programming languages
• Operations research
• Parallel computing
• Cilk
• Work stealing
• Pure
• Fibonacci number

ECMA-402 3rd Edition / June 2016 ECMAScript® 2016 Internationalization API Specification

Source URL: www.ecma-international.org

• Computing
• Software engineering
• Computer programming
• Cross-platform software
• Scripting languages
• ECMAScript
• Functional languages
• Ecma International
• C Sharp
• .NET Framework
• Java
• ECMA

Revised5 Report on the Algorithmic Language Scheme RICHARD H. ABELSON N. I. ADAMS IV D. H. BARTLEY

Source URL: www.math.purdue.edu

• Software engineering
• Computer programming
• Computing
• Functional languages
• Subroutines
• Procedural programming languages
• Data types
• Lambda calculus
• Scheme
• Lisp
• Anonymous function
• Scope

From ML to program proof or: The continuation of functional programming by other means Xavier Leroy INRIA Paris-Rocquencourt Milner symposium,

Source URL: events.inf.ed.ac.uk

• Software engineering
• Programming language theory
• Type theory
• Computing
• ML
• Type inference
• Polymorphism
• Type system
• Type class
• HindleyMilner type system
• Ad hoc polymorphism
• OCaml

Written Examination, May 28th, 2014 Course noThe duration of the examination is 4 hours. Course Name: Fun tional programming Allowed aids: All written material The problem set onsists of 3 problems whi h are wei

Source URL: www.imm.dtu.dk

PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT Advisor: Armando Solar-Lezama

Source URL: www.acm.org

• Software engineering
• Declarative programming
• Computer programming
• Functional programming
• Theoretical computer science
• Data types
• Type theory
• Computability theory
• Lambda calculus
• Recursion
• Algebraic data type
• Anonymous function

Norman Ramsey Associate Professor Department of Computer Science Tufts University Medford, MassachusettsEmail: Phone: +

Source URL: www.cs.tufts.edu

• Computer science
• Software engineering
• Computing
• Functional programming
• International Conference on Functional Programming
• Programming Language Design and Implementation
• Symposium on Principles of Programming Languages
• SIGPLAN
• ECL programming language
• Association for Computing Machinery
• Programming language theory